Classification of Partially Metric Q-Polynomial Association Schemes with $$m_{ 1} = 4$$
نویسندگان
چکیده
منابع مشابه
Association Schemes with Multiple Q-polynomial Structures
It is well known that an association scheme X = (X, {Ri}0≤i≤d) with k1 > 2 has at most two P polynomial structures. The parametrical condition for an association scheme to have twoP -polynomial structures is also known. In this paper, we give a similar result for Q-polynomial association schemes. In fact, if d > 5, then we obtain exactly the same parametrical conditions for the dual intersectio...
متن کاملImprimitive Q-polynomial Association Schemes
It is well known that imprimitive P -polynomial association schemes X = (X, {Ri}0≤i≤d) with k1 > 2 are either bipartite or antipodal, i.e., intersection numbers satisfy either ai = 0 for all i, or bi = cd−i for all i 6= [d/2]. In this paper, we show that imprimitiveQ-polynomial association schemesX = (X, {Ri}0≤i≤d) with d > 6 and k∗ 1 > 2 are either dual bipartite or dual antipodal, i.e., dual ...
متن کاملNew families of Q-polynomial association schemes
In this paper, we construct the first known infinite family of primitive Qpolynomial schemes which are not generated by distance-regular graphs. To construct these examples, we introduce the notion of a relative hemisystem of a generalized quadrangle with respect to a subquadrangle.
متن کاملt-designs with repeated points in Q-polynomial association schemes
L'auteur a fait des études en mathématiques à EUT, Eindhoven, Pays-Bas, avec spécialisation mathématiques discrètes, combinatoire et codage (équipe de v . Lint) et l'article fait partie de sa thèse « masters degree » (sorte de « thèse de troisième cycle ») . En mai 1982 l'auteur est entré au CNET, Issy-les-Moulineaux, pour faire de la recherche dans le domaine de traitement de signaux, plus pré...
متن کاملOn Q-Polynomial Association Schemes of Small Class
We show an inequality involving the third largest or second smallest dual eigenvalues of Q-polynomial association schemes of class at least three. Also we characterize dual-tight Q-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02237-x